615 research outputs found
Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition
The monochromatic tree partition number of an -edge-colored graph ,
denoted by , is the minimum integer such that whenever the edges of
are colored with colors, the vertices of can be covered by at most
vertex-disjoint monochromatic trees. In general, to determine this number
is very difficult. For 2-edge-colored complete multipartite graph, Kaneko,
Kano, and Suzuki gave the exact value of . In this
paper, we prove that if , and K(n,n) is 3-edge-colored such that every
vertex has color degree 3, then Comment: 16 page
A sharp upper bound for the rainbow 2-connection number of 2-connected graphs
A path in an edge-colored graph is called {\em rainbow} if no two edges of it
are colored the same. For an -connected graph and an integer with
, the {\em rainbow -connection number} of is
defined to be the minimum number of colors required to color the edges of
such that every two distinct vertices of are connected by at least
internally disjoint rainbow paths. Fujita et. al. proposed a problem that what
is the minimum constant such that for all 2-connected graphs on
vertices, we have . In this paper, we prove that
and if and only if is a cycle of order , settling
down this problem.Comment: 8 page
Bicyclic graphs with maximal revised Szeged index
The revised Szeged index is defined as where and are,
respectively, the number of vertices of lying closer to vertex than to
vertex and the number of vertices of lying closer to vertex than to
vertex , and is the number of vertices equidistant to and .
Hansen used the AutoGraphiX and made the following conjecture about the revised
Szeged index for a connected bicyclic graph of order :
Sz^*(G)\leq \{{array}{ll} (n^3+n^2-n-1)/4,& {if $n$ is odd}, (n^3+n^2-n)/4, &
{if $n$ is even}. {array}. with equality if and only if is the graph
obtained from the cycle by duplicating a single vertex. This paper is
to give a confirmative proof to this conjecture.Comment: 7 page
Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph
A vertex-colored graph is rainbow vertex-connected if any pair of
distinct vertices are connected by a path whose internal vertices have distinct
colors. The rainbow vertex-connection number of , denoted by , is
the minimum number of colors that are needed to make rainbow
vertex-connected. In this paper we give a Nordhaus-Gaddum-type result of the
rainbow vertex-connection number. We prove that when and are both
connected, then . Examples are given to show
that both the upper bound and the lower bound are best possible for all .Comment: 6 page
The (strong) rainbow connection numbers of Cayley graphs of Abelian groups
A path in an edge-colored graph , where adjacent edges may have the same
color, is called a rainbow path if no two edges of the path are colored the
same. The rainbow connection number of is the minimum integer
for which there exists an -edge-coloring of such that every two distinct
vertices of are connected by a rainbow path. The strong rainbow connection
number of is the minimum integer for which there exists an
-edge-coloring of such that every two distinct vertices and of
are connected by a rainbow path of length . In this paper, we give
upper and lower bounds of the (strong) rainbow connection Cayley graphs of
Abelian groups. Moreover, we determine the (strong) rainbow connection numbers
of some special cases.Comment: 12 page
The -proper index of graphs
A tree in an edge-colored graph is a \emph{proper tree} if any two
adjacent edges of are colored with different colors. Let be a graph of
order and be a fixed integer with . For a vertex set
, a tree containing the vertices of in is called an
\emph{-tree}. An edge-coloring of is called a \emph{-proper coloring}
if for every set of vertices in , there exists a proper -tree in
. The \emph{-proper index} of a nontrivial connected graph , denoted
by , is the smallest number of colors needed in a -proper coloring
of . In this paper, some simple observations about for a
nontrivial connected graph are stated. Meanwhile, the -proper indices of
some special graphs are determined, and for every pair of positive integers
, with , a connected graph with and
is constructed for each integer with . Also, the
graphs with -proper index and are respectively characterized.Comment: 12 page
On various (strong) rainbow connection numbers of graphs
An edge-coloured path is \emph{rainbow} if all the edges have distinct
colours. For a connected graph , the \emph{rainbow connection number}
is the minimum number of colours in an edge-colouring of such that,
any two vertices are connected by a rainbow path. Similarly, the \emph{strong
rainbow connection number} is the minimum number of colours in an
edge-colouring of such that, any two vertices are connected by a rainbow
geodesic (i.e., a path of shortest length). These two concepts of connectivity
in graphs were introduced by Chartrand et al.~in 2008. Subsequently,
vertex-coloured versions of both parameters, and , and a
total-coloured version of the rainbow connection number, , were
introduced. In this paper we introduce the strong total rainbow connection
number , which is the version of the strong rainbow connection number
using total-colourings. Among our results, we will determine the strong total
rainbow connection numbers of some special graphs. We will also compare the six
parameters, by considering how close and how far apart they can be from one
another. In particular, we will characterise all pairs of positive integers
and such that, there exists a graph with and ,
and similarly for the functions and .Comment: 17 page
Rainbow connection number of dense graphs
An edge-colored graph is rainbow connected, if any two vertices are
connected by a path whose edges have distinct colors. The rainbow connection
number of a connected graph , denoted , is the smallest number of
colors that are needed in order to make rainbow connected. In this paper we
show that , if , and ,
if . These bounds are sharp.Comment: 8 page
Tricyclic graphs with maximal revised Szeged index
The revised Szeged index of a graph is defined as where and are,
respectively, the number of vertices of lying closer to vertex than to
vertex and the number of vertices of lying closer to vertex than to
vertex , and is the number of vertices equidistant to and .
In this paper, we give an upper bound of the revised Szeged index for a
connected tricyclic graph, and also characterize those graphs that achieve the
upper bound.Comment: 14 pages. arXiv admin note: text overlap with arXiv:1104.212
The (revised) Szeged index and the Wiener index of a nonbipartite graph
Hansen et. al. used the computer programm AutoGraphiX to study the
differences between the Szeged index and the Wiener index , and
between the revised Szeged index and the Wiener index for a connected
graph . They conjectured that for a connected nonbipartite graph with vertices and girth Moreover, the
bound is best possible as shown by the graph composed of a cycle on 5 vertices,
, and a tree on vertices sharing a single vertex. They also
conjectured that for a connected nonbipartite graph with
vertices, Moreover, the bound is best
possible as shown by the graph composed of a cycle on 3 vertices, , and a
tree on vertices sharing a single vertex. In this paper, we not only
give confirmative proofs to these two conjectures but also characterize those
graphs that achieve the two lower bounds.Comment: 12 pages. arXiv admin note: text overlap with arXiv:1210.646
- β¦